Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities
نویسندگان
چکیده
منابع مشابه
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
We study the non-uniform capacitated multi-item lot-sizing (CMILS) problem. In this problem, there is a set of demands over a planning horizon of T time periods and all demands must be satisfied on time. We can place an order at the beginning of each period s, incurring an ordering cost Ks. The total quantity of all products ordered at time s can not exceed a given capacity Cs. On the other han...
متن کاملApproximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
We study the classical capacitated multi-item lot-sizing problem with hard capacities. There are N items, each of which has speci ed sequence of demands over a nite planning horizon of T discrete periods; the demands are known in advance but can vary from period to period. All demands must be satis ed on time. Each order incurs a time-dependent xed ordering cost regardless of the combination of...
متن کاملStrong Formulations for Multi-item Capacitated Lot Sizing*
Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities, which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems vnth up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the valid inequalities can easily be generat...
متن کاملProgressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands ...
متن کاملProbabilistic Analysis of Multi-Item Capacitated Lot Sizing Problems
This paper conducts a probabilistic analysis of an important class of heuristics for multiitem capacitated lot sizing problems. We characterize the asymptotic performance of so-called progressive interval heuristics as T , the length of the planning horizon, goes to infinity, assuming the data are realizations of a stochastic process of the following type: the vector of cost parameters follows ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2020
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2019.1018